Repetition Threshold for Circular Words
نویسندگان
چکیده
منابع مشابه
Repetition Threshold for Circular Words
We find the threshold between avoidable and unavoidable repetitions in circular words over k letters for any k > 6. Namely, we show that the number CRT(k) = ⌈k/2⌉+1 ⌈k/2⌉ satisfies the following properties. For any n there exists a k-ary circular word of length n containing no repetition of exponent greater than CRT(k). On the other hand, k-ary circular words of some lengths must have a repetit...
متن کاملFinite-Repetition threshold for infinite ternary words
The exponent of a word is the ratio of its length over its smallest period. The repetitive threshold r(a) of an a-letter alphabet is the smallest rational number for which there exists an infinite word whose finite factors have exponent at most r(a). This notion was introduced in 1972 by Dejean who gave the exact values of r(a) for every alphabet size a as it has been eventually proved in 2009....
متن کاملRepetition Avoidance in Circular Factors
We consider the following novel variation on a classical avoidance problem from combinatorics on words: instead of avoiding repetitions in all factors of a word, we avoid repetitions in all factors where each individual factor is considered as a “circular word”, i.e., the end of the word wraps around to the beginning. We determine the best possible avoidance exponent for alphabet size 2 and 3, ...
متن کاملFinite repetition threshold for large alphabets
We investigate the finite repetition threshold for k-letter alphabets, k ≥ 4, that is the smallest number r for which there exists an infinite r+-free word containing a finite number of r-powers. We show that there exists an infinite Dejean word on a 4-letter alphabet (i.e. a word without factors of exponent more than 7 5 ) containing only two 7 5 -powers. For a 5-letter alphabet, we show that ...
متن کاملRepresentations of Circular Words
In this article we give two different ways of representations of circular words. Representations with tuples are intended as a compact notation, while representations with trees give a way to easily process all conjugates of a word. The latter form can also be used as a graphical representation of periodic properties of finite (in some cases, infinite) words. We also define iterative representa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2012
ISSN: 1077-8926
DOI: 10.37236/2365